-
1 enumerable language
Большой англо-русский и русско-английский словарь > enumerable language
-
2 enumerable language
Математика: счётный язык -
3 enumerable language
мат. -
4 language
- absolutely homogeneous language - absolutely inadequate language - absolutely nonhomogeneous language - absolutely nonperfect language - absolutely nonsimple language - absolutely perfect language - absolutely simple language - completely formalized language - completely homogeneous language - left categorial language - locally perfectly adequate language - locally simple language - locally strongly language - locally well adequate language - noncompletely homogeneous language - right categorial language - scattered context languageindistinguishable in the language — лог. неразличимый на языке, эквивалентный
-
5 language that is not recursively enumerable
Программирование: неперечислимый языкУниверсальный англо-русский словарь > language that is not recursively enumerable
-
6 счетный язык
Большой англо-русский и русско-английский словарь > счетный язык
-
7 subset
1) модем3) подмножество•- analytic subset
- bifurcation subset
- bounded subset
- character subset
- closed subset
- complementary subset
- connected subset
- countable subset
- disjunctive subset
- elementary subset
- enumerable subset
- feature subset
- fundamental subset
- fuzzy subset
- language subset
- local-battery subset
- measurable subset
- numeral subset
- open subset
- ordered subset
- proper subset
- recursive subset
- scattered subset
- tame subset
- uncountable subset -
8 subset
1) модем3) подмножество•- analytic subset
- bifurcation subset
- bounded subset
- character subset
- closed subset
- complementary subset
- connected subset
- countable subset
- disjunctive subset
- elementary subset
- enumerable subset
- feature subset
- fundamental subset
- fuzzy subset
- language subset
- local-battery subset
- measurable subset
- numeral subset
- open subset
- ordered subset
- proper subset
- recursive subset
- scattered subset
- tame subset
- uncountable subsetThe New English-Russian Dictionary of Radio-electronics > subset
См. также в других словарях:
Recursively enumerable language — In mathematics, logic and computer science, a recursively enumerable language is a type of formal language which is also called partially decidable or Turing acceptable. It is known as a type 0 language in the Chomsky hierarchy of formal… … Wikipedia
Language identification in the limit — is a formal model for inductive inference. It was introduced by E. Mark Gold in his paper with the same title [http://www.isrl.uiuc.edu/ amag/langev/paper/gold67limit.html] . In this model, a learner is provided with presentation of some language … Wikipedia
Language Integrated Query — LINQ redirects here. For the card game, see Linq (card game). Language Integrated Query Influenced by SQL, Haskell Language Integrated Query (LINQ, pronounced link ) is a Microsoft .NET Framework component that adds native data querying… … Wikipedia
Recursively enumerable set — In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing recognizable if: There is an algorithm such that the set of… … Wikipedia
Recursive language — This article is about a class of formal languages as they are studied in mathematics and theoretical computer science. For computer languages that allow a function to call itself recursively, see Recursion (computer science). In mathematics,… … Wikipedia
List of formal language and literal string topics — This is a list of formal language and literal string topics, by Wikipedia page. Contents 1 Formal languages 2 Literal strings 3 Classical cryptography Formal languages Abstract syntax tree … Wikipedia
Oxygene (programming language) — Oxygene Developer RemObjects Software Stable release 3.0.21 (August 29, 2009; 2 years ago (2009 08 29)) Influenced by Object Pas … Wikipedia
Context-sensitive language — In theoretical computer science, a context sensitive language is a formal language that can be defined by a context sensitive grammar. That is one of the four types of grammars in the Chomsky hierarchy. Of the four, this is the least often used,… … Wikipedia
Context-free language — In formal language theory, a context free language is a language generated by some context free grammar. The set of all context free languages is identical to the set of languages accepted by pushdown automata. Contents 1 Examples 2 Closure… … Wikipedia
Mildly context-sensitive language — In formal grammar theory, mildly context sensitive languages are a class of formal languages which can be efficiently parsed, but still possess enough context sensitivity to allow the parsing of natural languages. The concept was first introduced … Wikipedia
Deterministic context-free language — A deterministic context free language is a formal language which is defined by a deterministic context free grammar.[1] The set of deterministic context free languages is called DCFL[2] and is identical to the set of languages accepted by a… … Wikipedia
